A class of cyclic queue with priority batch service
نویسندگان
چکیده
منابع مشابه
System Occupancy of a Two-Class Batch-Service Queue with Class-Dependent Variable Server Capacity
Due to their wide area of applications, queueing models with batch service, where the server can process several customers simultaneously, have been studied frequently. An important characteristic of such batch-service systems is the size of a batch, that is the number of customers that are processed simultaneously. In this paper, we analyse a two-class batch-service queueing model with variabl...
متن کاملA Preemptive Priority Queue with Accessible Batch Service and Heterogeneous Arrivals and with Vacation
In this paper a single server preemptive priority queuing system consisting of two types of customer units with Poisson arrival, exponential service time distribution and exponential vacation is analyzed. Two type of customer units of which higher priority units of unlimited Poisson input are served by bulk service rule and limited Poisson input of low priority units served singly. The bulk ser...
متن کاملA Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملDisributions in a Priority Queue with Batch Arrivals
We consider a single-server priority queue with batch arrivals. We treat the head-of-the-line (HL) or preemptive-resume (PR) priority rule. Assuming that the arrival process of batches is renewal for each priority class and using the point process approach, we express the individual class queue-length distribution in terms of the waiting time and the completion time distributions. Assuming furt...
متن کاملAnalysis of a Two-class Priority Queue with Bernoulli Schedules
A Bernoulli schedule is random service discipline for a multi-class priority queueing system which operates as follows: If queue i(l :s i :s N) is not empty just after servicing a message in its queue, a message in queue i is served again with probability Pi, and the highest class message present in the system is served with probability 1-Pi, where 0 :s Pi :s 1. This paper presents an analysis ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 1991
ISSN: 0307-904X
DOI: 10.1016/0307-904x(91)90034-m